Application of artificial neural network method to predict the breakage properties of PGE bearing chromite ore

In the present investigation, systematic grinding experiments were conducted in a laboratory ball mill to determine the breakage properties of low-grade PGE bearing chromite ore. The population balance modeling technique was used to study the breakage parameters such as primary breakage distribution (B_{i, j}) and the specific rates of breakage (S_i). The breakage and selection function values were determined for six feed sizes. The results stated that the breakage follows the first-order grinding kinetics for all the feed sizes. It was observed that the coarser feed sizes exhibit higher selection function values than the finer feed size. Further, an artificial neural network was used to predict breakage characteristics of low-grade PGE bearing chromite ore. The predicted results obtained from the neural network modeling were close to the experimental results with a correlation of determination R² = 0.99 for both product size and selection function.     

5万m~2地下特大型支撑爆破拆除

介绍了在复杂环境下爆破拆除一地下特大钢筋混凝土支撑的技术难点。由于合理选取爆破参数,采取孔内高段、孔外低段毫秒微差起爆网路,安全防护采取覆盖、近体、保护性三种措施,有效地阻止了飞石对周围建筑物的损害,并对爆破可能产生的危害进行了科学验算,最后分多次爆破圆满完成拆除任务。     

Learn decision trees with deep visual primitives

In this paper, we strive to propose a self-interpretable framework, termed PrimitiveTree, that incorporates deep visual primitives condensed from deep features with a conventional decision tree, bridging the gap between deep features extracted from deep neural networks (DNNs) and trees’ transparent decision-making processes. Specifically, we utilize a codebook, which embeds the continuous deep features into a finite discrete space (deep visual primitives) to distill the most common semantic information. The decision tree adopts the spatial location information and the mapped primitives to present the decision-making process of the deep features in a tree hierarchy. Moreover, the trained interpretable PrimitiveTree can inversely explain the constituents of the deep features, highlighting the most critical and semantic-rich image patches attributing to the final predictions of the given DNN. Extensive experiments and visualization results validate the effectiveness and interpretability of our method.     

Vertex-Edge Degree Based Indices of Honey Comb Derived Network

Chemical graph theory is a branch of mathematics which combines graph theory and chemistry. Chemical reaction network theory is a territory of applied mathematics that endeavors to display the conduct of genuine compound frameworks. It pulled the research community due to its applications in theoretical and organic chemistry since 1960. Additionally, it also increases the interest the mathematicians due to the interesting mathematical structures and problems are involved. The structure of an interconnection network can be represented by a graph. In the network, vertices represent the processor nodes and edges represent the links between the processor nodes. Graph invariants play a vital feature in graph theory and distinguish the structural properties of graphs and networks. In this paper, we determined the newly introduced topological indices namely, first -degree Zagreb index, first -degree Zagreb index, second -degree Zagreb index, -degree Randic index, -degree atom-bond connectivity index, -degree geometric-arithmetic index, -degree harmonic index and -degree sum-connectivity index for honey comb derived network. In the analysis of the quantitative structure property relationships (QSPRs) and the quantitative structureactivity relationships (QSARs), graph invariants are important tools to approximate and predicate the properties of the biological and chemical compounds. Also, we give the numerical and graphical representation of our outcomes.     

A Tradeoff Between Accuracy and Speed for K-Means Seed Determination

With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed.     

基于音频特征的工程车辆工况识别研究

高效率地使用工程车辆是工程项目管理中节约成本的有效方法，无人监管环境下工程车辆的工况识别，是实现工程车辆高效率使用的有效手段。目前以GPS等技术为核心的车辆智能管理系统未对工程车辆进行工况识别，提出一种基于GRU循环神经网络的工程车辆工况识别方法，通过对工程车辆在不同工况下产生的音频信号进行分析，从中提取Mel倒谱系数作为主要特征，构建GRU循环神经网络模型进行训练和识别。实验结果表明，该方法可以实现对工程车辆工况的有效识别。     

Neural Emotion Detection via Personal Attributes

There has been a recent line of work to automatically detect the emotions of posts in social media. In literature, studies treat posts independently and detect their emotions separately. Different from previous studies, we explore the dependence among relevant posts via authors' backgrounds, since the authors with similar backgrounds, e.g., "gender", "location", tend to express similar emotions. However, personal attributes are not easy to obtain in most social media websites. Accordingly, we propose two approaches to determine personal attributes and capture personal attributes between different posts for emotion detection: the Joint Model with Personal Attention Mechanism (JPA) model is used to detect emotion and personal attributes jointly, and capture the attributes-aware words to connect similar people; the Neural Personal Discrimination (NPD) model is employed to determine the personal attributes from posts and connect the relevant posts with similar attributes for emotion detection. Experimental results show the usefulness of personal attributes in emotion detection, and the effectiveness of the proposed JPA and NPD approaches in capturing personal attributes over the state-of-the-art statistic and neural models.